On the loss process in a batch arrival queue
نویسندگان
چکیده
منابع مشابه
Loss behavior in space priority queue with batch Markovian arrival process - continuous-time case
This paper applies a matrix-analytic approach to analyze both the long-term and the short-term loss behaviors of a queue with space priority scheme. Five related performance measures are derived from conditional statistics, including the long-term highpriority and low-priority packet loss probabilities, and the three short-term measures — the average length of a critical period, the average len...
متن کاملOn departure process in the batch arrival queue with single vacation and setup time
A single-server queueing system of MX/G/1 type with unlimited buffer size is considered. Whenever the system becomes empty, the server takes a single compulsory vacation that is independent of the arrival process. The service of the first customer after the vacation is preceded by a random setup time. We distinguish two cases of the evolution of the system: when the setup time begins after the ...
متن کاملOn departure process in the batch arrival queue with single vacation and setup time Wojciech
A single-server queueing system of MX/G/1 type with unlimited buffer size is considered. Whenever the system becomes empty, the server takes a single compulsory vacation that is independent of the arrival process. The service of the first customer after the vacation is preceded by a random setup time. We distinguish two cases of the evolution of the system: when the setup time begins after the ...
متن کاملSimple Approximations for the Batch-Arrival Mx/G/1 Queue
Batch-arrival queueing models can be used in 1) many practical situations, such as the analysis of message packetization in data communication systems. In general it is difficult, if not impossible, to find tractable expressions for the waiting-time probabilities of individual customers. It is, therefore, useful to have easily computable approximations for these probabilities. This paper gives ...
متن کاملBatch arrival queue with N-policy and single vacation
We consider an MXI ell queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length 11: When he returns from the vacation, if the system size is greater than or equal to a pretermined value N(threshold), he begins to serve the customers. If not, the server waits in the system until the system size reaches or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2009
ISSN: 0307-904X
DOI: 10.1016/j.apm.2008.11.015